An Evolutionary Multi-objective Discretization based on Normalized Cut

نویسندگان

  • M. Ghasemzadeh Electrical and Computer Engineering Department, Yazd University, Yazd, Iran.
چکیده مقاله:

Learning models and related results depend on the quality of the input data. If raw data is not properly cleaned and structured, the results are tending to be incorrect. Therefore, discretization as one of the preprocessing techniques plays an important role in learning processes. The most important challenge in the discretization process is to reduce the number of features’ values. This operation should be applied in a way that relationships between the features are maintained and accuracy of the classification algorithms would increase. In this paper, a new evolutionary multi-objective algorithm is presented. The proposed algorithm uses three objective functions to achieve high-quality discretization. The first and second objectives minimize the number of selected cut points and classification error, respectively. The third objective introduces a new criterion called the normalized cut, which uses the relationships between their features’ values to maintain the nature of the data. The performance of the proposed algorithm was tested using 20 benchmark datasets. According to the comparisons and the results of nonparametric statistical tests, the proposed algorithm has a better performance than other existing major methods.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adaptive Evolutionary Multi-Objective Approach Based on Simulated Annealing

A multi-objective optimization problem can be solved by decomposing it into one or more single objective subproblems in some multi-objective metaheuristic algorithms. Each subproblem corresponds to one weighted aggregation function. For example, MOEA/D is an evolutionary multi-objective optimization (EMO) algorithm that attempts to optimize multiple subproblems simultaneously by evolving a popu...

متن کامل

Image Segmentation Based on Fast Normalized Cut

In this paper, we propose a fast image segmentation method based on normalized cut. This method apply simple linear iterative clustering super-pixel algorithm to obtain super-pixel regions, and then use affinity propagation clustering to extract the representative pixels in each super-pixel regions, Finally, we apply normalized cut to obtain segmentation results. At the end of the paper, Numeri...

متن کامل

Portfolio optimization with an envelope-based multi-objective evolutionary algorithm

The problem of portfolio selection is a standard problem in financial engineering and has received a lot of attention in recent decades. Classical mean-variance portfolio selection aims at simultaneously maximizing the expected return of the portfolio and minimizing portfolio variance. In the case of linear constraints, the problem can be solved efficiently by parametric quadratic programming (...

متن کامل

Bipartition of graphs based on the normalized cut and spectral methods, Part I: Minimum normalized cut

The main objective of this paper is to solve the problem of finding graphs on which the spectral clustering method and the normalized cut produce different partitions. To this end, we derive formulae for minimum normalized cut for graphs in some classes such as paths, cycles, complete graphs, double-trees, lollipop graphs LPn,m, roach type graphs Rn,k and weighted paths Pn,k.

متن کامل

Wind Energy Uncertainties in Multi-objective Environmental/Economic Dispatch Based on Multi- objective Evolutionary Algorithm

This paper a Multi-objective Honey Bee Mating Optimization (MOHBMO) is proposed for Environmental/ Economic Power Dispatch (EED) problem. This paper proposes a new environmental/economic load dispatch model that considers cost and emission function coefficients with uncertainties and the constraints of ramp rate. Due to the environmental concerns that arise from the emissions produced via fossi...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 8  شماره 1

صفحات  25- 37

تاریخ انتشار 2020-01-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023